#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, t[N];

int main() {
#ifndef Local
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
#endif
    memset(t, 0, sizeof t);
    scanf("%d", &n);
    int x;
    for (int i = 1; i <= n; i++) {
        scanf("%d", &x);
        t[x]++;
    }
    int ans = -1;
    for (int i = 1; i <= 100000; i++)
        ans = max(ans, t[i]);
    printf("%d\n", ans);
    return 0;
}

